A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
نویسندگان
چکیده
منابع مشابه
A smoothing Broyden-like method for the mixed complementarity problems
K e y w o r d s M i x e d complementarity problem, Smoothing Broyden-like method, Global convergence, Superlinear convergence. 1. I N T R O D U C T I O N Let F : R n ~ R n be a cont inuous ly differentiable ma pp i ng and X = {1 < x < u} be a n o n e m p t y closed convex set in R n. The mixed complementarity problem, denoted by MCP(F), is to find a vector x* E X, such that F (x*) T (x x*) _> 0...
متن کاملA derivative–free nonmonotone line search technique for unconstrained optimization
A tolerant derivative–free nonmonotone line search technique is proposed and analyzed. Several consecutive increases in the objective function and also non descent directions are admitted for unconstrained minimization. To exemplify the power of this new line search we describe a direct search algorithm in which the directions are chosen randomly. The convergence properties of this random metho...
متن کاملA Nonmonotone Line Search Method for Symmetric Nonlinear Equations
In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. Under suitable conditions, the global convergence of the method is proved. Numerical results show that the presented method is practicable for the test problems.
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملAn R-Linearly Convergent Nonmonotone Derivative-Free Method for Symmetric Cone Complementarity Problems
This paper extends the derivative-free descent method [18] for the nonlinear complementarity problem to the symmetric cone complementarity problem (SCCP). The algorithm is based on the unconstrained implicit Lagrangian reformulation of the SCCP, but uses a convex combination of the negative partial gradients of the implicit Lagrangian function ψα, i.e. the vector of the form −θ∇xψα −(1 −θ)∇yψα ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.06.022